Menu #1
Main pageHow GIMPS worksDownload softwareFrequently Asked QuestionsSpeed of various CPUsPrizes you could win!Search statusTop producersPrimeNet statistics
Marin Mersenne
filler
GIMPS
Prime Search
7 World Records

How it Works

Dot
2^P-1
filler
Menu #2
HistoryThe math behind GIMPSSource codeJoin a mailing listManual testingCreditsLinksSend e-mailOther computing projects
May 2004: Mersenne Prime Found!
Dot

This page describes what you will need to participate in GIMPS and how it works on your computer. This page is aimed at people with Intel-compatible personal computers, although in many cases it is possible for UNIX and PowerMac users to participate as well.

GIMPS requires a Pentium class computer that is on most of the time. The program runs at the lowest possible priority. You should not see any impact on your system's performance. The program will use about 8MB of memory and about 10MB of disk space.

Most importantly, you will need a lot of patience. Roughly speaking it will take about a month to run a single primality test - visit the benchmark page for a more accurate estimate on your computer.

If you've decided you have a powerful enough computer and enough patience to stick with the project, then visit the download page for instructions on downloading, installing, and starting the program.

The program talks to PrimeNet, a central server on the Internet, to get work to do and report results. The program communicates using the HTTP protocol and may require a little extra configuration to get through some firewalls. The program only sends a few hundred bytes every week or two. Thus, there is no impact on your network performance. The program does not require a continuous Internet connection and if properly configured will not automatically dial out to establish an Internet connection.

There are three types of work assigned by the server. PIII-900 and faster computers get first-time primality tests. These tests require the most work and have the best chance of finding a new Mersenne prime. PII-233 and faster computers get double-check assignments. These assignments do not take as long and can find a Mersenne prime only if the original test had a problem. The slowest computers are assigned factoring work. This helps by eliminating some exponents for the faster computers.

Every half hour the program saves its state so that if there is a computer crash you will lose at most a half-hour of work. All temporary files and program settings are conveniently stored in the same folder as the program.

Before you complete your assignment, the program will get more work to do. This will assure that your computer has a continuous supply of work.

If you are lucky enough to find a new Mersenne prime, the program notifies the server and optionally emits a continuous sound to notify you of the happy news!


Last updated: September 23, 2004

Getting started: Main page | How it works | Download | FAQ | Benchmarks | Prizes
Learning more: History | The math | Source code | Mailing list
Project status: Status | Top producers | PrimeNet
Miscellaneous: Manual testing | Credits | Links | Feedback | Other projects